satisfaction n. 1.滿足,滿意,舒服 (at; with)。 2.〔a satisfaction〕 使(欲望等)滿足的事物。 3.償還,賠償,義務的履行 (for)。 4.賠償物。 5.【宗教】苦行贖罪。 6.(雪恥,挽回名譽損失的)決斗;報復。 I heard the news with great [much] satisfaction. 我聽了這個消息非常滿意。 It will be a great satisfaction to you to know that .... 你如果聽到…一定很滿意。 demand satisfaction 要求道歉[決斗,賠償]。 enter (up) satisfaction 在法院備案表明已償清應付款項。 give satisfaction 使滿足[滿意];賠償;答應決斗。 in full and complete satisfaction 照數還訖,全數還清。 in satisfaction of 作為…的賠償。 make satisfaction for 賠償,償還 (satisfaction for a debt [crime] 還債,贖[罪])。 to sb.'s satisfaction =to the satisfaction of 使…滿意地,…得使…滿意。
constraint n. 1.強迫,拘束。 2.約束,壓抑,拘泥。 3.強制力。 4.緊張感[狀態]。 by constraint 勉強,強迫。 feel constraint覺得局促不安,感受壓迫。 show constraint顯得局促。 under [in] constraint 被迫,不得不;被束縛著。
Study on university courses arrangement based on constraint satisfaction 基于約束滿足的高校排課問題研究
Efficient sequential pattern mining algorithm based on average value constraint satisfaction pruning strategy 基于均值約束滿足度剪枝策略的高效序列模式挖掘算法
The intelligent fixing test paper is a process of the problem of constraint satisfaction based on a typical relational database 摘要智能組卷是一個典型的基于關系數據庫多約束滿足的問題求解過程。
As with other engineering design , die design is , by its nature , a constraint satisfaction problem , how to tailor design space in accordance with constraints 冷沖模設計同其它工程設計一樣,本質上是一個約束滿足問題,其實質就是多個約束條件裁減設計空間。
For this reason , the thesis presents an approach based on constraint satisfaction , symbolic execution and extended finite state machines . it can analyze programs written in a subset of the c programming language 針對上述情況,本文中提出了一種方法,它基于約束滿足問題求解方法和擴展有限狀態機上的符號執行算法,能夠對c語言子集描述的程序進行分析。
Artificial neural network is a new active member of all intelligent optimization methods . based on previous constraint satisfaction neural networks , this thesis applies a new constraint satisfaction neural network ( csnn ) for job - shop scheduling problems . based on the general model of nerve cell , the csnn declares 3 types of nerve cells as following : ( 1 ) st ( starting time ) cells , ( 2 ) sc ( sequence constraint ) cells and ( 3 ) rc ( resource constraint ) cells 本文對csnn以及jsp問題的討論分為三個階段:第一階段討論了基本的csnn網絡在jsp問題中的應用;第二階段以前一階段為基礎,將3個啟發式算法加入到csnn網絡中,這3個啟發式算法可以單獨使用或混合使用;第三階段給出了廣義作業車間調度問題的概念,并討論了基本的以及加入了啟發式算法的csnn網絡在廣義作業車間調度問題上的應用。
I regard qsim as a kind of constraint satisfaction problem ( csp ) , and improve the qualitative simulation algorithm by constraint logic programming ( clp ) . fuzzy qualitative simulation develops conventional qsim on several facets , such as representation of qualitative value , state transition rule and filtering algorithms . it bridges the gap between pure qualitative and quantitative , and improve the efficien 前者是將定性仿真算法看作一類約束滿足問題,用約束邏輯程序加以改進,不僅為解決定性仿真問題提供了邏輯框架,而且也是一種規范化的程序描述語言;模糊定性仿真算法則是對純定性仿真算法在知識描述、狀態轉移規則、過濾算法等方面的改進,是一類半定量描述方法,有利于在定性仿真領域綜合定量信息,同時提高算法的效率。
Pretreatment is used to generate alternate activities to achieve the requirements . theproblem after pretreatment is characterized as a constraint satisfaction problem , which is solvedby the local search algorithm based on dynamic priority . the solution means to specifycorrespondingactivitiesforeveryrequirementandtoallocateexecutingtimeandresources . in order to validate the modeling framework presented in this paper , a software system isdesigned to implement the mission planning and scheduling for msrs 預處理過程自動生成完成任務需求的候選活動集;預處理之后的問題被描述為一個約束滿足問題,通過基于動態優先級的局部鄰域搜索算法完成問題的求解,即為每個需求指定相應的活動,并為這些活動安排執行時間并指派資源。
This paper presents a generalproblem - solving framework for modeling multi - issue multilateral negotiationusing fuzzy constraints . agent negotiation isformulated as a distributed fuzzy constraint satisfaction problem dfcsp . fuzzy constrains are thus used to naturally represent each agent s desiresinvolving imprecision and human conceptualization , particularly when lexicalimprecision and subjective matters are concerned 隨著網際網絡的快速發展,信息社會的來臨,人們期望能隨時隨地相互連系交換訊息以取得所需的信息,造成目前的信息環境具有開放巨大及異質的特性。
To explain how to use the heuristics information of the problem to construct constraint - based solving algorithm , the general constraint satisfaction solving technology was briefly introduced , then the principles and the applicability of constraint propagation algorithm , tree search algorithm and heuristics repair algorithm for job shop scheduling were summarized 摘要為了說明如何利用啟發式信息構造車間調度的約束滿足求解算法,首先概述了常規約束滿足求解技術,進而介紹了車間調度問題的約束傳播算法、樹搜索算法和啟發式修復算法的構造原理及適用性。
百科解釋
In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that satisfies all constraints.